A Markov Chain Analysis of Genetic Algorithms: Large Deviation Principle Approach

In this paper we prove that the stationary distribution of populations in genetic algorithms focuses on the uniform population with the highest fitness value as the selective pressure goes to ∞ and the mutation probability goes to 0. The obtained sufficient condition is based on thework ofAlbuquerque andMazza (2000), who, followingCerf (1998), applied the large deviation principle approach (Freidlin–Wentzell theory) to the Markov chain of genetic algorithms. The sufficient condition is more general than that of Albuquerque and Mazza, and covers a set of parameters which were not found by Cerf.